The vertex-connectivity of a distance-regular graph
نویسندگان
چکیده
منابع مشابه
The vertex-connectivity of a distance-regular graph
The vertex-connectivity of a distance-regular graph equals its valency. © 2008 Dr Andries E. Brouwer. Published by Elsevier Ltd. All rights reserved.
متن کاملAverage distance and vertex-connectivity
The average distance μ(G) of a connected graph G of order n is the average of the distances between all pairs of vertices of G, i.e., μ(G) = ( n 2 )−1∑ {x,y}⊂V (G) dG(x, y), where V (G) denotes the vertex set of G and dG(x, y) is the distance between x and y. We prove that if G is a κ-vertex-connected graph, κ ≥ 3 an odd integer, of order n, then μ(G) ≤ n 2(κ+1) + O(1). Our bound is shown to be...
متن کاملSubgraphs Graph in a Distance-regular Graph
Let Γ denote a D-bounded distance-regular graph, where D ≥ 3 is the diameter of Γ. For 0 ≤ s ≤ D − 3 and a weak-geodetically closed subgraph ∆ of Γ with diameter s, define a graph G(∆) whose vertex set is the collection of all weak-geodetically closed subgraphs of diameter s+2 containing ∆, and vertex Ω is adjacent to vertex Ω′ in G if and only if Ω∩Ω′ as a subgraph of Γ has diameter s+1. We sh...
متن کاملA Questionable Distance-Regular Graph
In this paper, we introduce distance-regular graphs and develop the intersection algebra for these graphs which is based upon its intersection numbers. We discuss results following from the definition of the intersection algebra. We investigate two examples of distance-regular graphs and show how these results apply. Finally, we introduce parameters that determine intersection numbers. We inves...
متن کاملDistance regular covers of the complete graph
Distance regular graphs fall into three families: primitive, antipodal, and bipar-tite. Each antipodal distance regular graph is a covering graph of a smaller (usually primitive) distance regular graph; the antipodal distance graphs of diameter three are covers of the complete graph, and are the first non-trivial case. Many of the known examples are connected with geometric objects, such as pro...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: European Journal of Combinatorics
سال: 2009
ISSN: 0195-6698
DOI: 10.1016/j.ejc.2008.07.006